Weightwise perfectly balanced functions with high weightwise nonlinearity profile

نویسندگان

  • Jian Liu
  • Sihem Mesnager
چکیده

Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher [13]. In this paper, we propose a large class of weightwise perfectly balanced (WPB) functions, which is not extended affinely (EA) equivalent to the known constructions. We also discuss the weightwise nonlinearity profile of these functions, and present general lower bounds on k-weightwise nonlinearity, where k is a power of 2. Moreover, we exhibit a subclass of the family. By a recursive lower bound, we show that these subclass of WPB functions have very high weightwise nonlinearity profile.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Construction for Balanced Boolean Functions with Very High Nonlinearity

In the past twenty years, there were only a few constructions for Boolean functions with nonlinearity exceeding the quadratic bound 2n−1 − 2(n−1)/2 when n is odd (we shall call them Boolean functions with very high nonlinearity). The first basic construction was by Patterson and Wiedemann in 1983, which produced unbalanced function with very high nonlinearity. But for cryptographic applications...

متن کامل

Highly Nonlinear 0-1 Balanced Boolean Functions Satisfying Strict Avalanche Criterion

Nonlinearity, 0-1 balancedness and strict avalanche criterion (SAC) are important criteria for cryptographic functions. Bent functions have maximum nonlinearity and satisfy SAC however they are not 01 balanced and hence cannot be directly used in many cryptosystems where 0-1 balancedness is needed. In this paper we construct (i) 0-1 balanced boolean functions on V2k+1 (k ≥ 1) having nonlinearit...

متن کامل

Nonlinearity and Propagation Characteristics of Balanced Boolean Functions

Three important criteria for cryptographically strong Boolean functions are balance, nonlinearity and the propagation criterion. The main contribution of this paper is to reveal a number of interesting properties of balance and nonlinearity, and to study systematic methods for constructing Boolean functions that satisfy some or all of the three criteria. We show that concatenating, splitting, m...

متن کامل

Highly Nonlinear 0 - 1 Balanced Boolean Functions Satisfying

Nonlinearity, 0-1 balancedness and strict avalanche criterion (SAC) are important criteria for cryptographic functions. Bent functions have maximum nonlinearity and satisfy SAC however they are not 0-1 balanced and hence cannot be directly used in many cryptosystems where 0-1 balancedness is needed. In this paper we construct (i) 0-1 balanced boolean functions on V2k+1 (k > = 1) having nonlinea...

متن کامل

Balanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity

In this paper, we present a class of 2k-variable balanced Boolean functions and a class of 2k-variable 1-resilient Boolean functions for an integer k ≥ 2, which both have the maximal algebraic degree and very high nonlinearity. Based on a newly proposed conjecture by Tu and Deng, it is shown that the proposed balanced Boolean functions have optimal algebraic immunity and the 1-resilient Boolean...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1709.02959  شماره 

صفحات  -

تاریخ انتشار 2017